Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015     

基于储备模式选择的战备物资分类研究

对战备物资进行分类是选择储备模式的基础和重要前提。把战备物资分类问题抽象为战备物资的军事性和经济性评价问题,设计了物资分类评价指标体系,并对部分指标进行了说明;利用层次分析法确定各指标的权重,运用专家打分法完成指标打分,并对专家打分程序进行优化,增强战备物资分类的可操作性,由军事性和经济性两方面的得分确定战备物资所属类别;最后通过算例证明了分类方法的有效性。     

多UAV协同区域覆盖侦察方法

针对多UAV对未知区域的协同覆盖侦察问题,提出了将STC算法与在线局部调整策略相结合的区域覆盖侦察方法.通过建立无重叠覆盖区域的闭合路径,最小化了重复侦察区域,缩短了任务执行时间;通过在线局部调整保证了只要有一架UAV不出现故障,侦察任务就可以正常进行.仿真结果表明,该方法能够有效解决多UAV协同区域覆盖侦察问题,方法...     

基于遗传算法与支持向量机的火炮内膛疵病分类方法研究

支持向量机能够较好解决小样本、非线性数据特征的多分类问题,适用于火炮内膛疵病的分类,但其性能依赖于其参数的选取;对基本遗传算法进行改进,使用自适应的交叉算子和变异算子,并应用于支持向量机参数优化;通过对火炮内膛疵病分类精度的对比研究,改进的遗传算法确定支持向量机优化参数的方法取得了良好的效果,验证了该方法对疵病分类的有效性。     

一种新的舰船辐射噪声特征提取方法

提出了一种基于Dopplerlet变换的舰船辐射噪声特征提取方法,给出了Dopplerlet变换分解流程。使用此种方法及基于小波变换、波形结构、自然尺度等的特征提取方法对收集到的舰船辐射噪声进行了识别试验,试验结果证明基于Dopplerlet变换的舰船辐射噪声特征提取方法更加有效。     

基于损伤树及损伤征兆集的战场损伤定位研究

建立了基于损伤树的知识表示、知识推理模型及损伤树评估框架,利用损伤树各节点的损伤征兆集,进行装备战场损伤定位,较好地利用了装备专家的领域知识,提高了战场损伤评估的准确性和效率。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种新型NoC互连算法及连线冗余的修正

片上网络(Noc)是一种新兴的以包交换为通信方式的芯片互连结构。NoC的互连问题可以抽象为在有障碍曼哈顿平面生成最小森林的图论问题,本文提出了一种新型的NoC互连算法,该算法通过对连线边长权重进行更改后再调用最小生成树算法,并针对连线冗余进行修正。实验表明,该算法使得片上网络的全局连线长度最小,从而解决传统片上总线结构中连线延时长、信号完整性差等缺点。     

飞机系统安全性指标的Petri Net分配方法

为解决动态故障树抽象而不利于交流的问题,利用Petri Net直观、易用且适用范围广的优点,提出基于Petri Net的飞机系统安全性指标分配方法。通过整理安全性指标及其相关的可靠性指标,选取失效率作为安全性指标,对比动态故障树及Petri Net建模方法,选取后者建立静态逻辑变迁和动态逻辑变迁的Petri Net指标分配模型。在此基础上,提出考虑严酷等级的系统安全性指标分配方法,经过算例分析,构建Petri Net层次系统故障模型进行指标分配。结果表明,分配值均在相应安全性指标内,该方法能够克服动态故障树法不直观、等分配法分配过于粗糙等缺陷,为飞机安全性设计与评估提供参考。     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011